A simple axiomatizable theory of truth.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Reliability Theory of Truth

Our approach is basically a coherence approach, but we avoid the well-known pitfalls of coherence theories of truth. Consistency is replaced by reliability, which expresses support and attack, and, in principle, every theory (or agent, message) counts. At the same time, we do not require a priviledged access to ”reality”. A centerpiece of our approach is that we attribute reliability also to ag...

متن کامل

A Simple Treatment of Truth Functions

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

The theory of integrally closed domains is not finitely axiomatizable

It is well-known that the theory of algebraically closed fields is not finitely axiomatizable. In this note, we prove that the theory of integrally closed integral domains is also not finitely axiomatizable. All rings in this paper are assumed commutative with identity. Let L be the language of rings, that is, the language whose signature consists of equality, binary function symbols + and ·, a...

متن کامل

Kripke’s Theory of Truth

(1) If y is a subset of some member of A, then y is a subset of ∪A. I.e., ∃z(z ∈ A ∧ y ⊆ z)→ y ⊆ ∪A. A fortioiri, if z ∈ A, then z ⊆ ∪A. (2) If y is a superset of every member of A, then y is a superset of ∪A. I.e.,∀z(z ∈ A → z ⊆ y) → ∩A ⊆ y. A fortiori, if z ∈ A, then ∩A ⊆ z. (3) If y is a subset of every member of A, then y is a subset of ∩A. I.e.,∀z(z ∈ A→ y ⊆ z)→ y ⊆ ∩A. (4) If y is a super...

متن کامل

The Truth Is Sometimes Simple

Note: The following version of this paper does not contain the proofs of the stated theorems. A longer version, complete with proofs, is forthcoming. §1. Introduction. In "The truth is never simple" (1986) and its addendum (1988), Burgess conducts a breathtakingly comprehensive survey of the complexity of the set of truths which arise when you add a truth predicate to arithmetic, and interpret ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1991

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093635841